How to Bargain: An Interval Approach

نویسندگان

  • Vladik Kreinovich
  • Hung T. Nguyen
  • Songsak Sriboonchitta
چکیده

In many real-life situations, we need to bargain. What is the best bargaining strategy? If you are already in a negotiating process, your previous offer was a, the seller’s last offer was a > a, what next offer a should you make? A usual commonsense recommendation is to “split the difference”, i.e., to offer a = (a+a)/2, or, more generally, to offer a linear combination a = k · a+ (1− k) · a (for some parameter k ∈ (0, 1)). The bargaining problem falls under the scope of the theory of cooperative games. In cooperative games, there are many reasonable solution concepts. Some of these solution concepts – like Nash’s bargaining solution that recommends maximizing the product of utility gains – lead to offers that linearly depend on a and a; other concepts lead to non-linear dependence. From the practical viewpoint, it is desirable to come up with a recommendation that would not depend on a specific selection of the solution concept – and on specific difficult-to-verify assumptions about the utility function etc. In this paper, we deliver such a recommendation: specifically, we show that under reasonable assumption, we should always select an offer that linearly depends on a and a.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How Saqaliba slaves were transferred to Andalusia in the Umayyad period

Slave bargain that was common in the West of Europe for a long time continued after the conquer of Andalusia by Muslims in the last decade of the first century A.H. Meanwhile, slaves from the northern regions of Spain, especially Slavic lands, entered the Andalusian markets. These slaves, known in medieval Islamic sources as Saqaliba, were often bought by Jewish merchants and transferred to And...

متن کامل

Measuring the overall performances of decision-making units in the presence of imprecise data

Data envelopment analysis (DEA) is a method for measuring the relative efficiencies of a set of decision-making units (DMUs) that use multiple inputs to produce multiple outputs. In this paper, we study the measurement of DMU performances in DEA in situations where input and/or output values are given as imprecise data. By imprecise data we mean situations where we only know that the actual val...

متن کامل

DEA with Missing Data: An Interval Data Assignment Approach

In the classical data envelopment analysis (DEA) models, inputs and outputs are assumed as known variables, and these models cannot deal with unknown amounts of variables directly. In recent years, there are few researches on handling missing data. This paper suggests a new interval based approach to apply missing data, which is the modified version of Kousmanen (2009) approach. First, the prop...

متن کامل

A new interval approach for setting the distance relay zones to achieve perfect selectivity and maximum sensitivity

In this paper, an interval approach is presented to achieve perfect selectivity and maximum sensitivity in distance relay zones, considering uncertainties. For this purpose, first, the uncertainties affecting the settings of the three zones of a distance relay are discussed. Then, by using the Monte-Carlo simulation, the uncertainties are modelled and the impedances seen by the distance relay a...

متن کامل

An Interval Assignment Problem with Multiple Attributes: A DEA-Based Approach

One of the basic combinatorial optimization problems is the assignment problem that deals with assigning jobs to individuals. In traditional assignment problems, n jobs usually assign to n individuals such that the total cost is minimized or the total profit is maximized. However, in numerous real-life applications, various attributes could be considered in assignment problems while data (obj...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010